Conditional maximum likelihood timing recovery: estimators and bounds
نویسندگان
چکیده
This paper is concerned with the derivation of new estimators and performance bounds for the problem of timing estimation of (linearly) digitally modulated signals. The conditional maximum likelihood (CML) method is adopted, in contrast to the classical low-SNR unconditional ML (UML) formulation that is systematically applied in the literature for the derivation of non-data-aided (NDA) timing-error-detectors (TEDs). A new CML TED is derived and proved to be self-noise free, in contrast to the conventional low-SNR-UML TED. In addition, the paper provides a derivation of the conditional Cramér–Rao Bound (CRB ), which is higher (less optimistic) than the modified CRB (MCRB) [which is only reached by decision-directed (DD) methods]. It is shown that the CRB is a lower bound on the asymptotic statistical accuracy of the set of consistent estimators that are quadratic with respect to the received signal. Although the obtained bound is not general, it applies to most NDA synchronizers proposed in the literature. A closed-form expression of the conditional CRB is obtained, and numerical results confirm that the CML TED attains the new bound for moderate to high .
منابع مشابه
Conditional Maximum Likelihood Estimation of the First-Order Spatial Integer-Valued Autoregressive (SINAR(1,1)) Model
‎Recently a first-order Spatial Integer-valued Autoregressive‎ ‎SINAR(1,1) model was introduced to model spatial data that comes‎ ‎in counts citep{ghodsi2012}‎. ‎Some properties of this model‎ ‎have been established and the Yule-Walker estimator has been‎ ‎proposed for this model‎. ‎In this paper‎, ‎we introduce the...
متن کاملJoint Data Aided ML Symbol Timing and Frequency Offset Estimation in MIMO systems
In this paper training based joint Maximum Likelihood (ML) symbol timing and frequency offset estimation in MIMO flat fading channels is considered. In the proposed joint ML algorithm we use two stages to maximize a metric and obtain timing and frequency offset estimates. We compare the Mean Square Error (MSE) performance of the joint ML estimator with the MSE performance of individual timing a...
متن کاملSample Complexity of Composite Likelihood
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to composite likelihood [14], which generalizes maximum likelihood and pseudolikelihood [3]. Moreover, we show that the only existing algorithm with a PAC bound for learning high-treewidth discrete models [1] can be viewed as...
متن کاملEstimating a Bounded Normal Mean Relative to Squared Error Loss Function
Let be a random sample from a normal distribution with unknown mean and known variance The usual estimator of the mean, i.e., sample mean is the maximum likelihood estimator which under squared error loss function is minimax and admissible estimator. In many practical situations, is known in advance to lie in an interval, say for some In this case, the maximum likelihood estimator...
متن کاملOptimality of estimators for misspecified semi-Markov models
Suppose we observe a geometrically ergodic semi-Markov process and have a parametric model for the transition distribution of the embedded Markov chain, for the conditional distribution of the inter-arrival times, or for both. The first two models for the process are semiparametric, and the parameters can be estimated by conditional maximum likelihood estimators. The third model for the process...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Signal Processing
دوره 49 شماره
صفحات -
تاریخ انتشار 2001